CS 269 I : Incentives in Computer Science Lecture # 16 : Revenue - Maximizing Auctions ∗
نویسنده
چکیده
Thus far, we’ve focused on the design of auctions that maximize the social welfare (at least in the case where bids are truthful). Welfare maximization is a first-order concern in many scenarios, and as we’ve seen, this objective has guided the design of auctions for sponsored search and online advertising more generally. Revenue is generated in welfare-maximizing auctions, but only as a side effect, a necessary evil to incentivize participants to report their private information. (Remember what happened when we tried to charge nothing in a single-item auction?) What if our goal is to maximize the seller’s revenue, rather than the social welfare? This lecture, our last on auction design, explains the changes that need to be made.
منابع مشابه
CS 269 I : Incentives in Computer Science Lecture # 15 : The VCG Mechanism ∗
First we prove the important result stated last lecture about sponsored search auctions. Recall the setup: there are k slots with click-through-rates (CTRs) α1 ≥ α2 ≥ · · · ≥ αk, and each bidder i = 1, 2, . . . , n has a private valuation per-click vi. (Bids and prices are also per-click.) Our first attempt to generalize the Vickrey auction to sponsored search results in the “Generalized Second...
متن کاملCS364B: Frontiers in Mechanism Design Lecture #18: Multi-Parameter Revenue-Maximization∗
With this lecture we commence the fifth and final part of the course. All previous lectures focused on the objective of maximizing the welfare ∑n i=1 vi(Si) of an auction. In these last three lectures, we study the objective of maximizing the revenue ∑n i=1 pi of an auction. Of course, all of the auctions that we’ve studied to generate revenue, but only as a side effect of the quest for incenti...
متن کاملCS 269 I : Incentives in Computer Science Lecture # 6 : Incentivizing Participation ∗
Last lecture, we discussed the broken incentives in Gnutella, where a Prisoner’s Dilemmatype scenario gives users a strong incentive to free ride. This is one version of a broader issue, that of incentivizing participation. (In Gnutella, we can equate uploading with participating.) As you can imagine, incentivizing high levels of participation is a first-order concern for many systems and busin...
متن کاملCS364A: Algorithmic Game Theory Lecture #5: Revenue-Maximizing Auctions∗
over all feasible outcomes (x1, . . . , xn) in some set X. Revenue is generated in welfaremaximizing auctions, but only as a side effect, a necessary evil to incentivize participants to report their private information. This lecture begins our discussion of auctions that are explicitly designed to raise as much revenue as possible. We started with the welfare objective for several reasons. One ...
متن کاملCS364B: Frontiers in Mechanism Design Lecture #20: Characterization of Revenue-Maximizing Auctions∗
Recall what we are shooting for: a multi-parameter analog of Myerson’s theory of revenuemaximizing optimal auctions. Single-parameter optimal mechanisms are virtual welfare maximizers. We’ve seen that multi-parameter optimal mechanisms are generally randomized. It would seem that the coolest statement that could be true is: revenue-maximizing optimal auctions for multi-parameter problems are al...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2016